On the max-weight edge coloring problem
نویسندگان
چکیده
منابع مشابه
On the max-weight edge coloring problem
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We explore the frontier between polynomial and NP-hard variants of the problem as well as the approximability of the NP-har...
متن کاملApproximating the Max Edge-Coloring Problem
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems. In this problem each color class is assigned the weight of the heaviest edge in this class and the objective is to find a proper edge-coloring of the input graph minimizing the sum of all color classes’ weights. We present new approximation re...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملOn the Max Coloring Problem
We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive node weights w : V → (0,∞), the goal is to find a proper node coloring of G whose color classes C1, C2, . . . , Ck minimize k ∑ i=1 maxv∈Ci w(v). We design a general framework which allows to convert approximation algorithms for standard node coloring into algorithms fo...
متن کاملImproved Approximation Algorithms for the Max-Edge Coloring Problem
The Max Edge-Coloring (MEC) problem is a natural weighted generalization of the classical edgecoloring problem. Formally, in the MEC problem we are given a graph G = (V,E) with a weight function w : E → N , and we ask for a proper edge-coloring of G, M = {M1,M2, . . . ,Mk}, such that the sum of the weights of the heaviest edges in the color classes, W = ∑k i=1max{w(e)|e ∈ Mi}, is minimized. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2009
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-009-9223-z